#include"binarytree.h"

int main()
{
	/*BTNode* root = BinaryTreeCreate();
	int n = BinaryTreeSize(root);
	int n2 = BinaryTreeLeafSize(root);
	int n3 = BinaryTreeLevelKSize(root,4);
	BTNode* node = BinaryTreeFind(root, 3);
	printf("%d %d %d\n", n,n2,n3);
	BinaryTreePrevOrder(root);
	printf("\n");
	BinaryTreeInOrder(root);
	printf("\n");
	BinaryTreePostOrder(root);
	printf("\n");*/
    char str[100] = "ABD##E#H##CF##G#I##";
	int n = strlen(str);
	int pi = 0;
	BTNode * head = BinaryTreeCreate(str, n, &pi);
	/*BinaryTreePrevOrder(head);
	printf("\n");
	BinaryTreeInOrder(head);
	printf("\n");
	BinaryTreePostOrder(head);
	printf("\n");*/
	//BinaryTreeLevelOrder(head);
	//printf("\n");
	//
	printf("%d ", BinaryTreeLevelKSize(head,4));
	return 0;
}